Non-scalable locks are dangerous

نویسندگان

  • Silas Boyd-Wickizer
  • M. Frans Kaashoek
  • Robert Morris
  • Nickolai Zeldovich
چکیده

Several operating systems rely on non-scalable spin locks for serialization. For example, the Linux kernel uses ticket spin locks, even though scalable locks have better theoretical properties. Using Linux on a 48-core machine, this paper shows that non-scalable locks can cause dramatic collapse in the performance of real workloads, even for very short critical sections. The nature and sudden onset of collapse are explained with a new Markovbased performance model. Replacing the offending nonscalable spin locks with scalable spin locks avoids the collapse and requires modest changes to source code.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Lock cohorting: A general technique for designing NUMA locks Citation

Multicore machines are quickly shifting to NUMA and CC-NUMA architectures, making scalable NUMA-aware locking algorithms, ones that take into account the machines’ non-uniform memory and caching hierarchy, ever more important. This paper presents lock cohorting, a general new technique for designing NUMA-aware locks that is as simple as it is powerful. Lock cohorting allows one to transform any...

متن کامل

RH Lock: A Scalable Hierarchical Spin Lock

Scalable architectures with non-uniform memory access time (NUMAs) have gained increased popularity in recent years. The increased scalability have increased the demand for scalable lock implementations, such as the queue-based locks of Mellor-Crummey and Scott (MCS lock), and of Craig, Landin and Hagersten (CLH lock). This paper demonstrates that the first-come first-served nature of queue-bas...

متن کامل

Scalable NUMA-aware Blocking Synchronization Primitives

Application scalability is a critical aspect to efficiently use NUMA machines with many cores. To achieve that, various techniques ranging from task placement to data sharding are used in practice. However, from the perspective of an operating system, these techniques often do not work as expected because various subsystems in the OS interact and share data structures among themselves, resultin...

متن کامل

A Comparative Study on the Mechanism, Form and Decorations of Contemporary Chaleshtor Locks and Those from the Safavid Isfahan

Lock is a device that assures safety of human’s life. Iranian locksmiths, in addition to making locks and meeting the essential needs, valued the decorative aspects of such tools. Including pendants and movable types, these locks are portable and they are different from standard, ordinary ones. Artists in this field have incorporated a wide range of artistic, spiritual, cultural and aesthetic v...

متن کامل

Implementation of Scalable Blocking Locks Using an Adaptive Thread Scheduler

Blocking locks are commonly used in parallel programs to improve application performance and system throughput. However, most implementations of such locks suuer from two major problems { latency and scalability. In this paper, we propose an implementation of blocking locks using scheduler adaptation which exploits the interaction between thread schedulers and locks. By experimentation using we...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012